A witness version of the Cops and Robber game
نویسنده
چکیده
The games considered aremixtures of Searching andCops andRobber. The cops havepartial information provided viawitnesseswho report ‘‘sightings’’ of the robber. Thewitnesses are able to provide information about the robber’s position but not the direction in which he is moving. The robber has perfect information. In the case when sightings occur at regular intervals, we present a recognition theorem for graphs on which a single cop suffices to guarantee a win. In a special case, this recognition theorem provides a characterization. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
Some remarks on cops and drunk robbers
The cops and robbers game has been extensively studied under the assumption of optimal play by both the cops and the robbers. In this paper we study the problem in which cops are chasing a drunk robber (that is, a robber who performs a random walk) on a graph. Our main goal is to characterize the “cost of drunkenness.” Specifically, we study the ratio of expected capture times for the optimal v...
متن کاملA Tandem version of the Cops and Robber Game played on products of graphs
In this version of the Cops and Robber game, the cops move in tandems, or pairs, such that they are at distance at most one from each other after every move. The problem is to determine, for a given graph G, the minimum number of tandems sufficient to guarantee a win for the cops. We investigate this game on three graph products, the Cartesian, categorical and strong products.
متن کاملThe Role of Visibility in Pursuit / Evasion Games
The cops-and-robber (CR) game has been used in mobile robotics as a discretized model (played on a graph G) of pursuit/evasion problems. The “classic” CR version is a perfect information game: the cops’ (pursuer’s) location is always known to the robber (evader) and vice versa. Many variants of the classic game can be defined: the robber can be invisible and also the robber can be either advers...
متن کاملThe Cop Number of the One-Cop-Moves Game on Planar Graphs
Cops and robbers is a vertex-pursuit game played on graphs. In the classical cops-and-robbers game, a set of cops and a robber occupy the vertices of the graph and move alternately along the graph’s edges with perfect information about each other’s positions. If a cop eventually occupies the same vertex as the robber, then the cops win; the robber wins if she can indefinitely evade capture. Aig...
متن کاملComplexity of the Cop and Robber Guarding Game
The guarding game is a game in which a set of cops has to guard a region in a digraph against a robber. The robber and the cops are placed on vertices of the graph; they take turns in moving to adjacent vertices (or staying). The goal of the robber is to enter the guarded region at a vertex with no cop on it. The problem is to find the minimum number of cops needed to prevent the robber from en...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009